Markovian models of Internet Caches including Closed-Form Stationary Distributions

An large number of different caching mechanisms have been previously proposed [1], [2], [6], exploring different insertion and eviction policies and their performance individually and as part of caching networks. We obtain a novel closed-form stationary invariant distribution for Markov model of a generalization of LRU and MRU caching nodes. Numerical comparisons are made with an “Incremental Rank Progress” (CLIMB) and random eviction/replacement methods under a Zipf popularity distribution. The range of cache hit probabilities is smaller under MRU and larger under IRP compared to LRU.